A grouping hyper-heuristic framework: Application on graph colouring
نویسندگان
چکیده
منابع مشابه
A grouping hyper-heuristic framework: Application on graph colouring
Grouping problems are hard to solve combinatorial optimisation problems which require partitioning of objects into a minimum number of subsets while a given objective is simultaneously optimized. Selection hyper-heuristics are high level general purpose search methodologies that operate on a space formed by a set of low level heuristics rather than solutions. Most of the recently proposed selec...
متن کاملGreedy Graph Colouring is a Misleading Heuristic
Let G = (V,E) be a (finite, simple, undirected) graph with vertex set V and edge set E. A clique in G is a set of vertices, each of which is adjacent to every other vertex in this set. The maximum clique problem is to find a largest such set in a given graph; this is NP-hard [GJ90]. We denote the size of a maximum clique by ω. A colouring of G is an assignment of vertices to colours such that n...
متن کاملA self-organising hyper-heuristic framework
Hyper-heuristics can be thought of as heuristic management methodologies which are motivated by the goal of building a high level of generality in the scope of computational search methodologies [2] [7]. Most meta-heuristics (and other search methods) perform a search over the solution space directly, whereas, hyper-heuristics as high level strategies search a heuristic space. One of the hyper-...
متن کاملHyperion - A Recursive Hyper-Heuristic Framework
Hyper-heuristics are methodologies used to search the space of heuristics for solving computationally di cult problems. We describe an object-oriented domain analysis for hyper-heuristics that orthogonally decomposes the domain into generative policy components. The framework facilitates the recursive instantiation of hyper-heuristics over hyper-heuristics, allowing further exploration of the p...
متن کاملA cooperative hyper-heuristic search framework
In this paper, we aim to investigate the role of cooperation between low level heuristics within a hyper-heuristic framework. Since different low level heuristics have different strengths and weaknesses, we believe that cooperation can allow the strengths of one low level heuristic to compensate for the weaknesses of another. We propose an agent-based cooperative hyper-heuristic framework compo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Expert Systems with Applications
سال: 2015
ISSN: 0957-4174
DOI: 10.1016/j.eswa.2015.01.038